A Novel Group Key Management Based on Jacobian Elliptic Chebyshev Rational Map

نویسندگان

  • Qin Ke
  • Zhou Mingtian
  • Liu Naiqi
  • Hao Yujie
  • Guo Jiandong
چکیده

This paper proposes a novel scheme of group key management based on Jacobian Elliptic Chebyshev Rational Map, named Jacobian Group Key Management(JGKM). The scheme is more efficient than other group key managements since fewer re-keying messages are sent when group membership changes. Besides, it provides both forward and backward secrecy. Therefore, this proposal is helpful to deploy secure multicast over some networks with high latency or limited bandwidth such as wireless network. Furthermore, it fits both small-scale and large-scale groups.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Watermarking Scheme Based on Multiple Chaotic Maps

a watermarking scheme for Grayscale image isproposed based on a family of the chaotic maps and discretecosine transform. Jacobian Elliptic mapis employed to encrypt ofwatermarked logo. Piecewise nonlinear chaotic map is also usedto determine the location of DCT coefficients for the watermarkembedding. The purpose of this algorithm is to improve theshortcoming of watermarking such as small key s...

متن کامل

3-dimensional Chaotic Dynamics on Jacobian Elliptic Space Curve

Sufficient conditions have been recently given for a classs of ergodic maps of an interval onto itself: I = [0, 1] ⊂ R1 → I and its associated binary function to generate a sequence of independent and idetically distributed (i.i.d.) random variables. Jacobian elliptic Chebyshev map, its derivative and second derivative induce Jacobian elliptic space curve. A mapping of the space curve onto itse...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

Generalized Jacobian and Discrete Logarithm Problem on Elliptic Curves

Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...

متن کامل

18 . 783 Elliptic Curves Spring 2015

In Lecture 1 we defined an elliptic curve as a smooth projective curve of genus 1 with a distinguished rational point. An equivalent definition is that an elliptic curve is an abelian variety of dimension one. An abelian variety is a smooth projective variety that is also a group, where the group operation is defined by rational functions (ratios of polynomials). Remarkably, these constraints f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007